منابع مشابه
Enumerations of the Kolmogorov function
A recursive enumerator for a function h is an algorithm f which enumerates for an input x finitely many elements including h(x). f is an k(n)-enumerator if for every input x of length n, h(x) is among the first k(n) elements enumerated by f . If there is a k(n)-enumerator for h then h is called k(n)-enumerable. We also consider enumerators which are only A-recursive for some oracle A. We determ...
متن کاملObservational Modeling of the Kolmogorov-Sinai Entropy
In this paper, Kolmogorov-Sinai entropy is studied using mathematical modeling of an observer $ Theta $. The relative entropy of a sub-$ sigma_Theta $-algebra having finite atoms is defined and then the ergodic properties of relative semi-dynamical systems are investigated. Also, a relative version of Kolmogorov-Sinai theorem is given. Finally, it is proved that the relative entropy of a...
متن کاملrehabilitation of the oral function of edentulous patient by implants توانبخشی کارکرد خوراک در بیماران بی دندان توسط ایمپلنت
چکیده ندارد.
15 صفحه اولinterpersonal function of language in subtitling
translation as a comunicative process is always said to be associated with various aspects of meaning loss or gain. subtitling as a mode of translating, due to special discoursal and textual conditions imposed upon it, is believed to be an obvious case of this loss or gain. presenting the spoken sound track of a film in writing and synchronizing the perception of this text by the viewers with...
15 صفحه اولRegular Enumerations
In the paper we introduce and study regular enumerations for arbitrary recursive ordinals. Several applications of the technique are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Logic
سال: 2006
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl/1146620156